Infinite Excess Entropy Processes with Countable-State Generators
نویسندگان
چکیده
We present two examples of finite-alphabet, infinite excess entropy processes generated by invariant hidden Markov models (HMMs) with countable state sets. The first, simpler example is not ergodic, but the second is. It appears these are the first constructions of processes of this type. Previous examples of infinite excess entropy processes over finite alphabets admit only invariant HMM presentations with uncountable state sets.
منابع مشابه
Bernoulli Actions and Infinite Entropy
We show that, for countable sofic groups, a Bernoulli action with infinite entropy base has infinite entropy with respect to every sofic approximation sequence. This builds on the work of Lewis Bowen in the case of finite entropy base and completes the computation of measure entropy for Bernoulli actions over countable sofic groups. One consequence is that such a Bernoulli action fails to have ...
متن کاملA local approach to the entropy of countable fuzzy partitions
This paper denes and investigates the ergodic proper-ties of the entropy of a countable partition of a fuzzy dynamical sys-tem at different points of the state space. It ultimately introducesthe local fuzzy entropy of a fuzzy dynamical system and proves itto be an isomorphism invariant.
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملFinite Generators for Countable Group Actions in the Borel and Baire Category Settings
For a continuous action of a countable discrete group G on a Polish space X, a countable Borel partition P of X is called a generator if GP ∶= {gP ∶ g ∈ G,P ∈ P} generates the Borel σ-algebra of X. For G = Z, the Kolmogorov–Sinai theorem gives a measuretheoretic obstruction to the existence of finite generators: they do not exist in the presence of an invariant probability measure with infinite...
متن کاملPermutation Excess Entropy and Mutual Information between the Past and Future
We address the excess entropy, which is a measure of complexity for stationary time series, from the ordinal point of view. We show that the permutation excess entropy is equal to the mutual information between two adjacent semi-infinite blocks in the space of orderings for finite-state stationary ergodic Markov processes. This result may shed a new light on the relationship between complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 16 شماره
صفحات -
تاریخ انتشار 2014